On linear operators strongly preserving invariants of Boolean matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear maps preserving or strongly preserving majorization on matrices

For $A,Bin M_{nm},$ we say that $A$ is left matrix majorized (resp. left matrix submajorized) by $B$ and write $Aprec_{ell}B$ (resp. $Aprec_{ell s}B$), if $A=RB$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $R.$ Moreover, we define the relation $sim_{ell s} $ on $M_{nm}$ as follows: $Asim_{ell s} B$ if $Aprec_{ell s} Bprec_{ell s} A.$ This paper characterizes all linear p...

متن کامل

linear maps preserving or strongly preserving majorization on matrices

for $a,bin m_{nm},$ we say that $a$ is left matrix majorized (resp. left matrix submajorized) by $b$ and write $aprec_{ell}b$ (resp. $aprec_{ell s}b$), if $a=rb$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $r.$ moreover, we define the relation $sim_{ell s} $ on $m_{nm}$ as follows: $asim_{ell s} b$ if $aprec_{ell s} bprec_{ell s} a.$ this paper characterizes all linear p...

متن کامل

Linear Operators on Matrices: Preserving Spectrum and Displacement Structure

In this paper we characterize those linear operators on general matrices that preserve singular values and displacement rank. We also characterize those linear operators on Hermitian matrices that preserve eigenvalues and displacement inertia.

متن کامل

Linear Operators Preserving the Numerical Range (Radius) on Triangular Matrices

We characterize those linear operators on triangular or diagonal matrices preserving the numerical range or radius.

متن کامل

Complexity of Linear Boolean Operators Complexity of Linear Boolean Operators

How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix rigidity), to combinatorial (Ramsey proper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 2012

ISSN: 0011-4642,1572-9141

DOI: 10.1007/s10587-012-0004-y